Ranking Function Synthesis for Bit-Vector Relations
نویسندگان
چکیده
Ranking function synthesis is a key aspect to the success of modern termination provers for imperative programs. While it is wellknown how to generate linear ranking functions for relations over (mathematical) integers or rationals, efficient synthesis of ranking functions for machine-level integers (bit-vectors) is an open problem. This is particularly relevant for the verification of low-level code. We propose several novel algorithms to generate ranking functions for relations over machine integers: a complete method based on a reduction to Presburger arithmetic, and a template-matching approach for predefined classes of ranking functions based on reduction to SATand QBF-solving. The utility of our algorithms is demonstrated on examples drawn from Windows device drivers.
منابع مشابه
Solutions of Fuzzy Linear Systems using Ranking function
In this work, we propose an approach for computing the compromised solution of an LR fuzzy linear system by using of a ranking function when the coefficient matrix is a crisp mn matrix. To do this, we use expected interval to find an LR fuzzy vector, X , such that the vector (AX ) has the least distance from (b) in 1 norm and the 1 cut of X satisfies the crisp linear system AX = b ...
متن کاملRanking Templates for Linear Loops
We present a new method for the constraint-based synthesis of termination arguments for linear loop programs based on linear ranking templates. Linear ranking templates are parametrized, well-founded relations such that an assignment to the parameters gives rise to a ranking function. This approach generalizes existing methods and enables us to use templates for many different ranking functions...
متن کاملCombining Vector Space Model and Multi Word Term Extraction for Semantic Query Refinement
In this paper, we target document ranking in a highly technical field with the aim to approximate a ranking that is obtained through an existing ontology (knowledge structure). We test and combine symbolic and vector space models (VSM). Our symbolic approach relies on shallow NLP and on internal linguistic relations between Multi-Word Terms (MWTs). Documents are ranked based on different semant...
متن کاملCombining Vector Space Model and Multi Word Term Extraction for Semantic Query Expansion
In this paper, we target document ranking in a highly technical field with the aim to approximate a ranking that is obtained through an existing ontology (knowledge structure). We test and combine symbolic and vector space models (VSM). Our symbolic approach relies on shallow NLP and on internal linguistic relations between Multi-Word Terms (MWTs). Documents are ranked based on different semant...
متن کاملUnrestricted Termination and Non-termination Arguments for Bit-Vector Programs
Proving program termination is typically done by finding a well-founded ranking function for the program states. Existing termination provers typically find ranking functions using either linear algebra or templates. As such they are often restricted to finding linear ranking functions over mathematical integers. This class of functions is insufficient for proving termination of many terminatin...
متن کامل